Xor-And-Inverter Graphs for Quantum Compilation

Abstract Quantum compilation is the task of translating a high-level description quantum algorithm into sequence low-level operations. We propose and motivate use Xor-And-Inverter Graphs (XAG) to specify Boolean functions for compilation. present three different XAG-based algorithms synthesize circuits in Clifford + T library, hence targeting fault-tolerant computing. The are designed minimize relevant cost functions, such as number qubits, -count, -depth, while allowing flexibility exploring solutions. novel resource estimation results cryptographic arithmetic benchmarks. achieved show significant reduction both -count -depth when compared with state-of-the-art.